A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs

In the literature on parameterized graph problems, there has been an increased effort in recent years aimed at exploring novel notions of edit-distance that are more powerful than size a modulator to specific class. this line research, Bulian and Dawar [Algorithmica, 75 (2016), pp. 363--382] introduced notion elimination distance showed deciding whether given most $k$ any minor-closed class graphs is fixed-parameter tractable by 79 (2017), 139--158]. They isomorphism bounded degree asked determining tractable. Recently, Lindermayr, Siebertz, Vigny [MFCS 2020, LIPIcs Leibniz Int. Proc. Inform. 170, Wadern Germany, 65] obtained algorithm for problem special case where input restricted $K_5$-minor free graphs. paper, we answer question affirmative general fact, give result capturing characterized finite set as forbidden induced subgraphs.